package 简单.修剪二插搜索树;

public class Solution1 {
    public TreeNode trimBST(TreeNode root, int low, int high) {

        if(root == null) return root;

        if(root.val > high) return trimBST(root.left,low,high);
        if (root.val < low) return trimBST(root.right,low,high);

        root.left = trimBST(root.left,low,high);
        root.right = trimBST(root.right,low,high);

        return root;
    }
}
